Design Electronic Circuits Using Evolutionary Algorithms

For the evolutionary algorithm, the representation of the electronic circuit has two methods, one kind is code with the electronic circuit solution space, the other is code with the problem space. How one representation quality weighs may think the following questions? The first is the code method should as far as possible complete, it is say for the significance solution circuit or the optimize solution obtains in the problem space may represented by this code method. The second is the code method should speeds up the convergence speed of the algorithm search. The hardware representation methods mainly include binary bit string representation, tree representation, Cartesian Genetic Programming representation and other representations. In this paper, we introduce the representations of the binary bit string and Cartesian Genetic Programming in detail, and based on the two representations we design the evolutionary algorithm for electronic circuits optimization. Then we introduce the encoding of the circuit as a chromosome, the genetic operators and the fitness function of our algorithm. For the case studies showed this algorithm has proved to be efficient, and the experiment results showed that we have gained better results.